翻訳と辞書
Words near each other
・ Simplicia cornicalis
・ Simplicia erebina
・ Simplicia extinctalis
・ Simplicia inareolalis
・ Simplicia inflexalis
・ Simplicia mistacalis
・ Simplicial approximation theorem
・ Simplicial category
・ Simplicial commutative ring
・ Simplicial complex
・ Simplicial group
・ Simple Pleasure
・ Simple Pleasures
・ Simple Pleasures (Alison Brown album)
・ Simple Pleasures (Bobby McFerrin album)
Simple polygon
・ Simple polytope
・ Simple Power
・ Simple precedence grammar
・ Simple precedence parser
・ Simple present
・ Simple prioritization
・ Simple programmable logic device
・ Simple public-key infrastructure
・ Simple random sample
・ Simple rational approximation
・ Simple resolution
・ Simple ring
・ Simple Science
・ Simple Sensor Interface protocol


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Simple polygon : ウィキペディア英語版
Simple polygon

In geometry a simple polygon is defined as a flat shape consisting of straight, non-intersecting line segments or "sides" that are joined pair-wise to form a closed path. If the sides intersect then the polygon is not simple. The qualifier "simple" is frequently omitted, with the above definition then being understood to define a polygon in general.
The definition given above ensures the following properties:
* A polygon encloses a region (called its interior) which always has a measurable area.
* The line segments that make-up a polygon (called sides or edges) meet only at their endpoints, called vertices (singular: vertex) or less formally "corners".
* Exactly two edges meet at each vertex.
* The number of edges always equals the number of vertices.
Two edges meeting at a corner are usually required to form an angle that is not straight (180°); otherwise, the collinear line segments will be considered parts of a single side.
Mathematicians typically use "polygon" to refer only to the shape made up by the line segments, not the enclosed region, however some may use "polygon" to refer to a plane figure that is bounded by a closed path, composed of a finite sequence of straight line segments (i.e., by a closed polygonal chain). According to the definition in use, this boundary may or may not form part of the polygon itself.〔Grünbaum, B.; ''Convex polytopes'' 2nd Ed, Springer, 2003〕
Simple polygons are also called Jordan polygons, because the Jordan curve theorem can be used to prove that such a polygon divides the plane into two regions, the region inside it and the region outside it. A simple polygon in the plane is topologically equivalent to a circle and its interior is topologically equivalent to a disk.
==Weakly simple polygon==

If a closed polygonal chain embedded in the plane divides it into two regions one of which is topologically equivalent to a disk, then the chain is called a weakly simple polygon. Informally, a weakly simple polygon is a polygon in which some sides can "touch" but cannot "cross over".
In the image on the left, ABCDEFGHJKLM is a weakly simple polygon with the color blue marking its interior.
In a more general definition of weakly simple polygons, they are the limits of sequences of simple polygons of the same combinatorial type, with the convergence under the Fréchet distance. The "interior" can be empty. For example, referring to the image above, the polygonal chain ABCBA is a weakly simple polygon: it may be viewed as the limit of "squeezing" of the polygon ABCFGHA.
Non-simple weakly simple polygons arise in computer graphics and CAD as a computer representation of polygonal regions with holes: for each hole a "cut" is created to connect it to an external boundary. Referring to the image above, ABCM is an external boundary of a planar region with a hole FGHJ. The cut ED connects the hole with the exterior and is traversed twice in the resulting weakly simple polygonal representation.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Simple polygon」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.